Combining CSP and Constraint-Based Mining for Pattern Discovery
نویسندگان
چکیده
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Combining CSP and Constraint-based Mining for Pattern Discovery Medhi Khiari, Patrice Boizumault, Bruno Crémilleux
منابع مشابه
Local Constraint-Based Mining and Set Constraint Programming for Pattern Discovery
Local patterns are at the core of the discovery of a lot of knowledge from data but their use is limited by their huge number. That it is why discovering global patterns and models from local patterns is an active research field. In this paper, we investigate the relationship between local constraint-based mining and constraint programming and we propose an approach to model and mine patterns c...
متن کاملSoft constraint based pattern mining
The paradigm of pattern discovery based on constraints was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially interesting patterns, with the positive side effect of achieving a more efficient computation. So far the research on this paradigm has mainly focused on the latter aspect: the development of efficient algorithms for the evaluation...
متن کاملThe Discovery of Frequent Patterns with Logic and Constraint Programming
The basic goal of data mining is to discover patterns occurring in the databases, such as associations, classification models, sequential patterns, and so on. In this paper we focus on the problem of frequent pattern discovery, which is the process of searching for patterns such as sets of features or items that appear in data frequently. Such frequent patterns can reveal associations, correlat...
متن کاملA Mining-Based Compression Approach for Constraint Satisfaction Problems
In this paper, we propose an extension of our Mining for SAT framework to Constraint satisfaction Problem (CSP). We consider n-ary extensional constraints (table constraints). Our approach aims to reduce the size of the CSP by exploiting the structure of the constraints graph and of its associated microstructure. More precisely, we apply itemset mining techniques to search for closed frequent i...
متن کاملSoft Threshold Constraints for Pattern Mining
Constraint-based pattern discovery is at the core of numerous data mining tasks. Patterns are extracted with respect to a given set of constraints (frequency, closedness, size, etc). In practice, many constraints require threshold values whose choice is often arbitrary. This difficulty is even harder when several thresholds are required and have to be combined. Moreover, patterns barely missing...
متن کامل